Experimental Analysis of 2-multiobjective Evolutionary Algorithm
نویسندگان
چکیده
A multi-objective optimization problem (MOP) is often found in real-world optimization problem. Among various multiobjective optimization techniques, multi-objective evolutionary algorithm (MOEA) is highlighted as a good candidate due to its flexibility, feasibility, and its ability to handle multiple solutions. Among various MOEAs, we analyze 2MOEA which can achieve good convergence and diversity using 2-dominance. We compare 2-MOEA with controlled elitist non-dominated sorting genetic algorithm (NSGA-II) which is currently one of the most popular and widely used MOEAs and have showed reasonable performance in various applications. We compare two algorithms experimentally for popular and scalable test function DTLZ2 and its modified version. The experimental results show that 2MOEA is better than NSGA-II in convergence and is comparable to NSGA-II in diversity.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملImproving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance
The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...
متن کاملLetters 1 Decomposition - Based Multiobjective Evolutionary 2 Algorithm with an Ensemble of Neighborhood Sizes 3
The multiobjective evolutionary algorithm based on de6 composition (MOEA/D) has demonstrated superior performance by 7 winning the multiobjective optimization algorithm competition at the 8 CEC 2009. For effective performance of MOEA/D, neighborhood size 9 (NS) parameter has to be tuned. In this letter, an ensemble of different 10 NSs with online self-adaptation is proposed (ENS-MOEA/D) to over...
متن کاملPareto-based Cost Simulated Annealing for Multiobjective Optimization
In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...
متن کاملA new multiobjective evolutionary algorithm
The Pareto-based approaches have shown some success in designing multiobjective evolutionary algorithms. Their methods of fitness assignment are mainly from the information of dominated and nondominated individuals. On the top of the hierarchy of multiobjective evolutionary algorithms, the Strength Pareto Evolutionary Algorithm (SPEA) has been elaborately designed with this principle in mind. I...
متن کاملExperimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms
In this paper we systematically study the importance, i.e., the influence on performance, of the main design elements that differentiate scalarizing functions-based multiobjective evolutionary algorithms (MOEAs). This class of MOEAs includes Multiobjecitve Genetic Local Search (MOGLS) and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D) and proved to be very successful in m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004